Riemannian Laplace Distribution on the Space of Symmetric Positive Definite Matrices
نویسندگان
چکیده
منابع مشابه
Riemannian Laplace Distribution on the Space of Symmetric Positive Definite Matrices
The Riemannian geometry of the space Pm, of m × m symmetric positive definite matrices, has provided effective tools to the fields of medical imaging, computer vision and radar signal processing. Still, an open challenge remains, which consists of extending these tools to correctly handle the presence of outliers (or abnormal data), arising from excessive noise or faulty measurements. The prese...
متن کاملRiemannian Metric Learning for Symmetric Positive Definite Matrices
Over the past few years, symmetric positive definite matrices (SPD) have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing SPD matrices, the two most widely-used measures are affine-invariant distance and log-Euclidean distance. This is because these two measures are true geodesic distances induced...
متن کاملRiemannian geometry on positive definite matrices
The Riemannian metric on the manifold of positive definite matrices is defined by a kernel function φ in the form K D(H,K) = ∑ i,j φ(λi, λj) −1TrPiHPjK when ∑ i λiPi is the spectral decomposition of the foot point D and the Hermitian matrices H,K are tangent vectors. For such kernel metrics the tangent space has an orthogonal decomposition. The pull-back of a kernel metric under a mapping D 7→ ...
متن کاملWasserstein Riemannian Geometry of Positive-definite Matrices∗
The Wasserstein distance on multivariate non-degenerate Gaussian densities is a Riemannian distance. After reviewing the properties of the distance and the metric geodesic, we derive an explicit form of the Riemannian metrics on positive-definite matrices and compute its tensor form with respect to the trace scalar product. The tensor is a matrix, which is the solution of a Lyapunov equation. W...
متن کاملRiemannian Sparse Coding for Positive Definite Matrices
Inspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extende...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2016
ISSN: 1099-4300
DOI: 10.3390/e18030098